Adaptive Query Processing in Point-Transformation Schemes

نویسنده

  • Byunggu Yu
چکیده

Point-transformation schemes transform multidimensional points to one-dimensional values so that conventional access methods can be used to index multidimensional points, enabling convenient integration of multidimensional query facilities into complex transactional database management systems. However, in high-dimensional data spaces, the computational complexity of the required query transformation is prohibitive. This paper proposes a nearoptimal solution based on our novel ideas of adaptive Z-ordering. The experimental results show that the proposed approach significantly improves the query performance of point-transformation schemes. The idea can easily be generalized to accommodate any hierarchical space-filling curve, not just the Zcurve.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Latency-Aware Query Processing in IoT Networks

The massive adoption of The Internet of Things (IoT) and the creation of a smart-world around us leads to several privacy and security concerns. There has been significant work in the past to address the privacy and confidentiality of IoT data such as: providing secure endto-end channels for the transmission of IoT data, encrypting IoT data using optimized cryptographic schemes such as order-pr...

متن کامل

Kinetic Data Structures for Clipped Voronoi Computations

We consider the mesh refinement problem in the kinetic setting: given an input set of moving points, the objective is to design a kinetic data structure (KDS) for inserting additional so-called Steiner points so that the resulting output set yields a quality triangulation. Therefore, the selection of Steiner points plays a cruicial role, both in terms of the output itself and the quality of the...

متن کامل

Lifting the Burden of History from Adaptive Query Processing

Adaptive query processing schemes attempt to reoptimize query plans during the course of query execution. A variety of techniques for adaptive query processing have been proposed, varying in the granularity at which they can make decisions [8]. The eddy [1] is the most aggressive of these techniques, with the flexibility to choose tuple-by-tuple how to order the application of operators. In thi...

متن کامل

Enabling Incremental Query Re-Optimization

As declarative query processing techniques expand in scope — to the Web, data streams, network routers, and cloud platforms — there is an increasing need for adaptive query processing techniques that can re-plan in the presence of failures or unanticipated performance changes. A status update on the data distributions or the compute nodes may have significant repercussions on the choice of whic...

متن کامل

Adapting the Transformation Technique to Maintain Multi-Dimensional Non-Point Objects in k-d-Tree Based Access Structures

In [10, 18] the transformation technique has been proposed to store k-dimensional intervals { which serve as bounding boxes for arbitrary geometric objects in many applications { as 2k-dimensional points in a point access structure. Unfortunately the transformation technique has two pitfalls: (1) The transformation leads to a skew distribution of the 2k-dimensional image points. (2) Processing ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005